Characterizing Weakly Terminating Partners of Open Systems
نویسندگان
چکیده
We study open systems modeled as finite state machines with an interface for asynchronous communication with other open systems. An open system P is a partner of an open system S, if the two systems can be composed to a closed system S ⊕ P that is weakly terminating (does not have deadlocks nor livelocks). Known controller synthesis techniques allow us to construct a most permissive partner MP(S) to a given open system S. Our contribution is to enhance MP(S) with Boolean annotations, yielding a finite characterization of all partners of S. We demonstrate the usefulness of this characterization by involving it in a decision procedure for accordance. Accordance is a canonical preorder on open systems: R accords with S if every partner of S is a partner of R. Our decision procedure reduces accordance to finding a simulation relation between MP(S) and MP(R) and checking validity of implications between related Boolean formulas.
منابع مشابه
On weakly e*-open and weakly e*-closed Functions
The aim of this paper is to introduce and study two new classes of functions called weakly $e^{*}$-open functions and weakly $e^{*}$-closed functions via the concept of $e^{*}$-open set defined by Ekici cite{erd1}. The notions of weakly $e^{*}$-open and weakly $e^{*}$-closed functions are weaker than the notions of weakly $beta$-open and weakly $beta$-closed functions defined by Caldas and Nava...
متن کاملOn weakly eR-open functions
The main goal of this paper is to introduce and study a new class of function via the notions of $e$-$theta$-open sets and $e$-$theta$-closure operator which are defined by Özkoç and Aslım [10] called weakly $eR$-open functions and $e$-$theta$-open functions. Moreover, we investigate not only some of their basic properties but also their relationships with other types of already existing topolo...
متن کاملNon - E - overlapping and weakly shallow TRSs are confluent ( Extended abstract ) Masahiko Sakai
Confluence of term rewriting systems (TRSs) is undecidable, even for flat TRSs [MOJ06] or length-two string rewrite systems [SW08]. Two decidable subclasses are known: right-linear and shallow TRSs by tree automata techniques [GT05] and terminating TRSs [KB70]. Most of sufficient conditions are for either terminating TRSs [KB70] (extended to TRSs with relative termination [HA11, KH12]) or leftl...
متن کاملOn pairwise weakly Lindelof bitopological spaces
In the present paper we introduce and study the notion of pairwise weakly Lindelof bitopological spaces and obtain some results. Further, we also study the pairwise weakly Lindelof subspaces and subsets, and investigate some of their properties. It was proved that a pairwise weakly Lindelof property is not a hereditary property.
متن کاملConvergence of product integration method applied for numerical solution of linear weakly singular Volterra systems
We develop and apply the product integration method to a large class of linear weakly singular Volterra systems. We show that under certain sufficient conditions this method converges. Numerical implementation of the method is illustrated by a benchmark problem originated from heat conduction.
متن کامل